LeetCode-Go/leetcode/0445.Add-Two-Numbers-II/445. Add Two Numbers II.go at master · halfrost/LeetCode-Go · GitHub

Name: LeetCode-Go/leetcode/0445.Add-Two-Numbers-II/445. Add Two Numbers II.go at master · halfrost/LeetCode-Go · GitHub
Rating: 4.9 (1689 reviews)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
package leetcode

import (
"github.com/halfrost/LeetCode-Go/structures"
)

// ListNode define
typeListNode= structures.ListNode

/**
 * Definition for singly-linked list.
 * type ListNode struct {
 * Val int
 * Next *ListNode
 * }
 */
funcaddTwoNumbers445(l1*ListNode, l2*ListNode) *ListNode {
ifl1==nil {
returnl2
 }
ifl2==nil {
returnl1
 }
l1Length:=getLength(l1)
l2Length:=getLength(l2)
newHeader:=&ListNode{Val: 1, Next: nil}
ifl1Length<l2Length {
newHeader.Next=addNode(l2, l1, l2Length-l1Length)
 } else {
newHeader.Next=addNode(l1, l2, l1Length-l2Length)
 }
ifnewHeader.Next.Val>9 {
newHeader.Next.Val=newHeader.Next.Val%10
returnnewHeader
 }
returnnewHeader.Next
}

funcaddNode(l1*ListNode, l2*ListNode, offsetint) *ListNode {
ifl1==nil {
returnnil
 }
var (
res, node*ListNode
 )
ifoffset==0 {
res=&ListNode{Val: l1.Val+l2.Val, Next: nil}
node=addNode(l1.Next, l2.Next, 0)
 } else {
res=&ListNode{Val: l1.Val, Next: nil}
node=addNode(l1.Next, l2, offset-1)
 }
ifnode!=nil&&node.Val>9 {
res.Val++
node.Val=node.Val%10
 }
res.Next=node
returnres
}

funcgetLength(l*ListNode) int {
count:=0
cur:=l
forcur!=nil {
count++
cur=cur.Next
 }
returncount
}

funcaddTwoNumbers1(l1*ListNode, l2*ListNode) *ListNode {
reservedL1:=reverseList(l1)
reservedL2:=reverseList(l2)

dummyHead:=&ListNode{}
head:=dummyHead
carry:=0
forreservedL1!=nil||reservedL2!=nil||carry>0 {
val:=carry
ifreservedL1!=nil {
val=reservedL1.Val+val
reservedL1=reservedL1.Next
 }
ifreservedL2!=nil {
val=reservedL2.Val+val
reservedL2=reservedL2.Next
 }
carry=val/10
head.Next=&ListNode{Val: val%10}
head=head.Next
 }
returnreverseList(dummyHead.Next)
}

funcreverseList(head*ListNode) *ListNode {
varprev*ListNode
forhead!=nil {
tmp:=head.Next
head.Next=prev

prev=head
head=tmp
 }
returnprev
}

funcaddTwoNumbers(l1*ListNode, l2*ListNode) *ListNode {
stack1:=pushStack(l1)
stack2:=pushStack(l2)

dummyHead:=&ListNode{}
head:=dummyHead
carry:=0
forlen(stack1) >0||len(stack2) >0||carry>0 {
val:=carry
iflen(stack1) >0 {
val=val+stack1[len(stack1)-1]
stack1=stack1[:len(stack1)-1]
 }
iflen(stack2) >0 {
val=val+stack2[len(stack2)-1]
stack2=stack2[:len(stack2)-1]
 }
carry=val/10
tmp:=head.Next
head.Next=&ListNode{Val: val%10, Next: tmp}
 }
returndummyHead.Next
}

funcpushStack(l*ListNode) []int {
varstack []int
forl!=nil {
stack=append(stack, l.Val)
l=l.Next
 }
returnstack
}